Compiling Hume down to gates
نویسندگان
چکیده
We describe the implementation of a subset of the Hume programming language on a FPGA architecture at the gate level. Hume is a domain specific language for developping multi-process systems requiring strong static guarantees that resource bounds are met. The compiler produces RT-level, synthetizable VHDL code that can be processed by a standard tool chain to program FPGAs at the gate level. Preliminary results suggest that this compilation route offers substantial opportunities for exploiting fine-grain parallelism in Hume programs. The approach also offers an significantly higher abstraction level than that offered by traditional hardware description languages such as VHDL or Verilog.
منابع مشابه
Efficient Discrete Approximations of Quantum Gates
Quantum compiling addresses the problem of approximating an arbitrary quantum gate with a string of gates drawn from a particular finite set. It has been shown that this is possible for almost all choices of base sets and furthermore that the number of gates required for precision ǫ is only polynomial in log 1/ǫ. Here we prove that using certain sets of base gates quantum compiling requires a s...
متن کاملTight Bounds on Discrete Approximations of Quantum Gates
Quantum compiling addresses the problem of approximating an arbitrary quantum gate with a string of gates drawn from a particular finite set. It has been shown that this is possible for almost all choices of base sets and furthermore that the number of gates required for precision ǫ is only polynomial in log 1/ǫ. Here we prove that quantum compiling requires a string length that is linear in lo...
متن کاملCompiling Quantum Circuits to Realistic Hardware Architectures using Temporal Planners
To run quantum algorithms on emerging gate-model quantum hardware, quantum circuits must be compiled to take into account constraints on the hardware. For near-term hardware, with only limited means to mitigate decoherence, it is critical to minimize the duration of the circuit. We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging qu...
متن کاملEfficient Decomposition of Single-Qubit Gates into V Basis Circuits
We develop the first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal V basis. The V basis is an alternative universal basis to the more commonly studied {H,T} basis. We propose two classical algorithms for quantum circuit compilation: the first algorithm has expected polynomial time (in precision log(1/ )) and offers a depth/precision guarantee ...
متن کاملCompiling Quantum Circuits using the Palindrome Transform
The design and optimization of quantum circuits is central to quantum computation. This paper presents new algorithms for compiling arbitrary 2 ×2 unitary matrices into efficient circuits of (n−1)controlled single-qubit and (n−1)-controlled-NOT gates. We first present a general algebraic optimization technique, which we call the Palindrome Transform, that can be used to minimize the number of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011